The Ellipsoid Method Generates Dual Variables
نویسندگان
چکیده
منابع مشابه
A New Ellipsoid Associated with Convex Bodies
Corresponding to each origin-symmetric convex (or more general) subset of Euclidean n-space R, there is a unique ellipsoid with the following property: The moment of inertia of the ellipsoid and the moment of inertia of the convex set are the same about every 1-dimensional subspace ofR. This ellipsoid is called the Legendre ellipsoid of the convex set. The Legendre ellipsoid and its polar (the ...
متن کاملAdaptive All-Hexahedral Mesh Generation Based on A Hybrid Octree and Bubble Packing
In this paper, a novel adaptive all-hexahedral (all-hex) mesh generation algorithm is proposed based on a hybrid octree. This hybrid octree consists of polyhedral cells and each grid point is always shared by eight cells by using a cutting procedure. A dual mesh with all-hex elements is then extracted by analyzing each grid point. Next, sphere or ellipsoid bubble packing is applied to improve t...
متن کاملComment on “Computing Correlated Equilibria in Multi-Player Games”
Noah Stein, Pablo Parrilo, and Asu Ozdaglar pointed out an error on page 10, lines 13-14 of our paper “Computing Correlated Equilibria in Multi-Player Games” (Journal of the ACM, 2008). The incorrect phrase is “...which contradicts our assumption that the violating y is within the current ellipsoid”. This conclusion would be valid for the bounding ellipsoid used for the original dual program (D...
متن کاملA Technique for Speeding Up the Solution of the Lagrangean Dual Dimitris
We propose new techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain st...
متن کاملA Technique for Speeding up the Solution of the Lagrangian Dual
We propose new techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 10 شماره
صفحات -
تاریخ انتشار 1985